Local List Recovery of High-Rate Tensor Codes and Applications
نویسندگان
چکیده
منابع مشابه
Local List Recovery of High-Rate Tensor Codes & Applications
In this work, we give the first construction of high-rate locally list-recoverable codes. Listrecovery has been an extremely useful building block in coding theory, and our motivation is to use these codes as such a building block. In particular, our construction gives the first capacity-achieving locally list-decodable codes (over constant-sized alphabet); the first capacity achieving globally...
متن کاملLinear-Time List Recovery of High-Rate Expander Codes
We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently list-decodable codes, as well as explicit constructions of matrices for compressive sensing and group testing. Previous list recoverable codes with linear-time decoding algorithms hav...
متن کاملList-decodable zero-rate codes
We consider list-decoding in the zero-rate regime for two cases: the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the maximal τ ∈ [0, 1] for which there exists an arrangement ofM balls of relative Hamming radius τ in the binary hypercube (of arbitrary dimension) with the property that no point of the latter is covered by L or more of them. As M →∞ the maxim...
متن کاملLinear time, high-rate, list-recoverable codes from expander graphs
We show that expander codes, when properly instantiated, are high-rate list-recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently listdecodable codes, as well as explicit constructions of matrices for compressive sensing and group testing. Previous list-recoverable codes with linear-time decoding algorithms have...
متن کاملGallager Codes for High Rate Applications
Gallager codes with large block length and low rate (e.g., N ' 10, 000–40, 000, R ' 0.25–0.5) have been shown to have recordbreaking performance for low signal-to-noise applications. Gallager codes with high rates (R ' 0.8–0.94) are also excellent, outperforming comparable BCH and Reed-Solomon codes, even at short blocklength (N ' 2, 000–4, 000) (MacKay and Davey, 2000). This paper looks in mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2019
ISSN: 0097-5397,1095-7111
DOI: 10.1137/17m116149x